A Variational Proof of Alexandrov's Convex Cap Theorem
نویسنده
چکیده
We give a variational proof of the existence and uniqueness of a convex cap with the given upper boundary. The proof uses the concavity of the total scalar curvature functional on the space of generalized convex caps. As a byproduct, we prove that generalized convex caps with the fixed boundary are globally rigid, that is uniquely determined by their curvatures.
منابع مشابه
Strong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کاملInfinitesimally Rigid Polyhedra. I. Statics of Frameworks
From the time of Cauchy, mathematicians have studied the motions of convex polyhedra, with the faces held rigid while changes are allowed in the dihedral angles. In the 1940s Alexandrov proved that, even with additional vertices along the natural edges, and with an arbitrary triangulation of the natural faces on these vertices, such polyhedra are infinitesimally rigid. In this paper the dual (a...
متن کاملA VARIATIONAL APPROACH TO THE EXISTENCE OF INFINITELY MANY SOLUTIONS FOR DIFFERENCE EQUATIONS
The existence of infinitely many solutions for an anisotropic discrete non-linear problem with variable exponent according to p(k)–Laplacian operator with Dirichlet boundary value condition, under appropriate behaviors of the non-linear term, is investigated. The technical approach is based on a local minimum theorem for differentiable functionals due to Ricceri. We point out a theorem as a spe...
متن کاملA pseudopolynomial algorithm for Alexandrov's theorem Citation
Alexandrov’s Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedron. Recent work by Bobenko and Izmestiev describes a differential equation whose solution is the polyhedron corresponding to a given metric. We describe an algorithm based on this differential equation to compute the pol...
متن کاملA Proof of Sudakov Theorem with Strictly Convex Norms
We establish a solution to the Monge problem in N , with an asymmetric, strictly convex norm cost function, when the initial measure is absolutely continuous. We focus on the strategy, based on disintegration of measures, initially proposed by Sudakov. As known, there is a gap to fill. The missing step is completed when the unit ball is strictly convex, but not necessarily differentiable nor un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 40 شماره
صفحات -
تاریخ انتشار 2008